A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

关于收缩算子的异步迭代收敛性

论证了Ｆ为收缩算子时,求解Ｘ＝Ｆ（Ｘ）的异步迭代方法初值选取范围,提出了异步迭代的大范围收敛方法。     

静磁场Dirichlet问题Galerkin法和牛顿法

作者在［１］,［２］中给出了静磁场Ｄｉｒｉｃｈｌｅｔ问题和Ｎｅｕｍａｎｎ问题广义解的存在与唯一性。本文从理论上给出静磁场Ｄｉｒｉｃｈｌｅｔ问题的一种Ｇａｌｅｒｋｉｎ近似解法,并给出了在各向同性或无电流区情形下的误差估计和牛顿选代序列。     

带限信号的最大熵正则外推算法

基于最大熵正则化构造了一种新的稳定的带限信号正则外推算法。当噪声δ（t）∈L~2[—T.T],其误差能量为δ,而且当δ→0时,所求得的正则化解将在（- ∞,∞）内一致收敛于问题的精确解。     

状态电子密度的数值反演

提出了一种计算状态电子密度的超分辨处理方法。这种方法是在Fourier变换的基础上,引入高频滤波器函数H（ω,α）,经滤波处理后,再取Fourier逆变换,得到近似解。此方法能够较好地抑制噪声干扰,且计算复杂性较低,文中给出了算法,证明了收敛性,最后给出了计算机实验结果。     

数据光滑的一种新方法

提出了用变形的Fourier部分和来代替Fourier级数将输入数据光滑的一种新方法。该方法能稳定地解某些不适定的问题,如给定函数的近似,求函数微分的问题;Laplace方程Cauchy问题;时间逆向热传导方程的Cauchy问题等。     

角速率火控系统倾斜修正问题的研究

倾斜修正是角速率火控系统研究、设计和生产中的一个重要课题。本文首先明确了几个基本概念,然后给出倾斜修正的计算方案,最后,应用四元数理论解决计算方案的工程实现问题。     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

一阶非线性脉冲边值问题解的存在性

研究一阶非线性脉冲周期边值问题，应用微分不等式和Schaefer不动点定理，得到了脉冲边值问题解存在的充分性判据，并给出了相应的Green函数。     

适用于认知无线传感器网络的高效频谱分配方法

广泛工作在ISM(Industrial,Scientific and Medical)频段的无线传感器网络面临严重的频谱稀缺问题。在无线通信中,动态频谱分配被认为是提高频谱效能的重要途径。针对典型集中式管理的认知无线传感器网络设计了基于图着色结合负载强度的高效频谱分配算法。首先在协议干扰模型下确保频谱资源在空间上充分利用,随后综合考虑节点负载强度与公平性建立优化模型并按照乘子法加拟牛顿法框架求解最优值。仿真实验表明算法与固定频谱分配方式和传统自适应频谱分配算法相比,在系统吞吐量和节点缓冲区队列长度两个关键性能指标上具有显著优势。